Mobile Location Tracking Scheme for Wireless Sensor Networks with Deicient Number of Sensor Nodes

نویسندگان

  • Po-Hsuan Tseng
  • Kai-Ten Feng
چکیده

A wireless sensor network (WSN) consists of sensor nodes (SNs) with wireless communication capabilities for specific sensing tasks. Among different applications, wireless location technologies which are designated to estimate the position of SNs (Geziciet al., 2005) (Haraet al., 2005) (Patwari et al., 2005)have drawn a lot of attention over the past few decades. There are increasing demands for commercial applications to adopt location tracking information within their system design, such as navigation systems, location-based billing, health care systems, and intelligent transportation systems. With emergent interests in location-based services (Perusco & Michael, 2007), location estimation and tracking algorithms with enhanced precision become necessitate for the applications under different circumstances. The location estimation schemes have been widely proposed and employed in the wireless communication system. These schemes locate the position of a mobile sensor (MS) based on the measured radio signals from its neighborhood anchor nodes (ANs). The representative algorithms for the measured distance techniques are the Time-Of-Arrival (TOA),the Time Difference-Of-Arrival (TDOA), and the Angle-Of-Arrival (AOA). The TOA scheme measures the arrival time of the radio signals coming from different wireless BSs; while the TDOA scheme measures the time difference between the radio signals. The AOA technique is conducted within the BS by observing the arriving angle of the signals coming from the MS. It is recognized that the equations associated with the location estimation schemes are inherently nonlinear. The uncertainties induced by the measurement noises make it more difficult to acquire the estimated MS position with tolerable precision. The Taylor Series Expansion (TSE) method was utilized in(Foy, 1976) to acquire the location estimation of the MS from the TOA measurements. The method requires iterative processes to obtain the location estimate from a linearized system. The major drawback of the TSE scheme is that it may suffer from the convergence problem due to an incorrect initial guess of the MS’s position. The two-step Least Square (LS) method was adopted to solve the location estimation problem from the TOA (Wanget al., 2003), the TDOA (Chen& Ho, 1994), and the hybrid TOA/TDOA(Tseng & Feng, 2009) measurements. It is an approximate 12

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring

Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...

متن کامل

An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks

This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...

متن کامل

An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks

This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...

متن کامل

Optimizing the Event-based Method of Localization in Wireless Sensor Networks

A Wireless Sensor Network (WSN) is a wireless decentralized structure network consists of many nodes. Nodes can be fixed or mobile. WSN applications typically observe some physical phenomenon through sampling of the environment so determine the location of events is an important issue in WSN. Wireless Localization used to determine the position of nodes. The precise localization in WSNs is a co...

متن کامل

A Rssi Based Localization Algorithm for WSN Using a Mobile Anchor Node

Wireless sensor networks attracting a great deal of research interest. Accurate localization of sensor nodes is a strong requirement in a wide area of applications. In recent years, several techniques have been proposed for localization in wireless sensor networks. In this paper we present a localization scheme with using only one mobile anchor station and received signal strength indicator tec...

متن کامل

A multi-hop PSO based localization algorithm for wireless sensor networks

A sensor network consists of a large number of sensor nodes that are distributed in a large geographic environment to collect data. Localization is one of the key issues in wireless sensor network researches because it is important to determine the location of an event. On the other side, finding the location of a wireless sensor node by the Global Positioning System (GPS) is not appropriate du...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012